Spike Time Coordination Maps to Diffusion Process
نویسندگان
چکیده
منابع مشابه
Time Coupled Diffusion Maps
We consider a collection of n points in R measured at m times, which are encoded in an n × d × m data tensor. Our objective is to define a single embedding of the n points into Euclidean space which summarizes the geometry as described by the data tensor. In the case of a fixed data set, diffusion maps (and related graph Laplacian methods) define such an embedding via the eigenfunctions of a di...
متن کاملMultivariate time-series analysis and diffusion maps
Dimensionality reduction in multivariate time series has broad applications, ranging from financial-data analysis to biomedical research. However, high levels of ambient noise and various interferences result in nonstationary signals, which may lead to inefficient performance of conventional methods. In this paper, we propose a nonlinear dimensionality reduction framework using diffusion maps o...
متن کاملAn Introduction to Diffusion Maps
This paper describes a mathematical technique [1] for dealing with dimensionality reduction. Given data in a high-dimensional space, we show how to find parameters that describe the lower-dimensional structures of which it is comprised. Unlike other popular methods such as Principle Component Analysis and Multi-dimensional Scaling, diffusion maps are non-linear and focus on discovering the unde...
متن کاملUnderstanding IS Team Coordination in Real Time: A Process Approach to Coordination
The current research-in-progress manuscript proposes a shift to a new approach to team coordination in IS projects. Previous studies have regarded team coordination through variance analyses. They identified explicit and implicit coordination mechanisms that are significantly related to team coordination, depending on some contingencies (e.g. team and task configuration, context). While such st...
متن کاملAdaptive Drift-Diffusion Process to Learn Time Interval
Animals learn the timing between consecutive events very easily. Their precision is usually proportional to the interval to time (Weber’s law for timing). Most current timing models either require a central clock and unbounded accumulator or whole pre-defined populations of delay lines, decaying traces or oscillators to represent elapsing time. Current adaptive recurrent neural networks fail at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Computational Neuroscience
سال: 2009
ISSN: 1662-5188
DOI: 10.3389/conf.neuro.10.2009.14.029